The Equational Part of Proofs by Structural Induction
نویسنده
چکیده
W
منابع مشابه
Heuristics for Completion in Automatic Proofs by Structural Induction
A method for proof by structural induction is studied, and problems of automatizing the method is investigated. We specially consider the equational part of such proofs and we observe that the ability to cope with possibly infinite searches for non-existent equational proofs is crucial. Completion as a means to find an equational proof of equivalence of two given terms is studied. By heuristics...
متن کاملConditional Lemma Discovery and Recursion Induction in Hipster
Hipster is a theory exploration tool for the proof assistant Isabelle/HOL. It automatically discovers lemmas about given recursive functions and datatypes and proves them by induction. Previously, only equational properties could be discovered. Conditional lemmas, for example required when reasoning about sorting, has been beyond the scope of theory exploration. In this paper we describe an ext...
متن کاملImplementing Anti-Unification Modulo Equational Theory
We present an implementation of E–anti–unification as defined in [Hei95], where tree–grammar descriptions of equivalence classes of terms are used to compute generalizations modulo equational theories. We discuss several improvements, including an efficient implementation of variable–restricted E–anti–unification from [Hei95], and give some runtime figures about them. We present applications in...
متن کاملPAM: A Process Algebra Manipulator
PAM is a general proof tool for process algebras. It allows users to deene their own calculi and then perform algebraic style proofs in these calculi by directly manipulating process terms. The logic that PAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. Equational reasoning is implemented by rewriting, while recur...
متن کاملInduction=I-Axiomatization+First-Order Consistency
In the early 80's, there was a number of papers on what should be called proofs by consistency. They describe how to perform inductive proofs, without using an explicit induction scheme, in the context of equational speciications and ground-convergent rewrite systems. The method was explicitly stated as a rst-order consistency proof in case of pure equational, constructor based, speciications. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- BIT
دوره 33 شماره
صفحات -
تاریخ انتشار 1993